Securely Computing the Three-Input Majority Function with Eight Cards

نویسندگان

  • Takuya Nishida
  • Takaaki Mizuki
  • Hideaki Sone
چکیده

Assume that Alice, Bob and Carol, each of whom privately holds a one-bit input, want to learn the value of the majority function of their inputs without revealing more of their own secret inputs than is necessary. In this paper, we show that such a secure majority computation can be done with a deck of real cards; specifically, the three players can learn only the majority of their inputs using eight physical cards—four black cards and four red cards—with identical backs.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Comparison of Three Soft Computing Methods in Estimating Apparent Shear Stress in Compound Channels

Apparent shear stress acting on a vertical interface between the main channel and floodplain in a compound channel serves to quantify the momentum transfer between sub sections of this cross section. In this study, three soft computing methods are used to simulate apparent shear stress in prismatic compound channels. The Genetic Algorithm Artificial neural network (GAA), Genetic Programming (GP...

متن کامل

Computations with a deck of cards

A deck of cards can be used as a cryptographic tool ([3], [6]). Using a protocol that securely computes the Boolean AND function, one can construct a protocol for securely computing any Boolean function. This, in turn, can be used for secure multiparty computations, solitary games, zero knowledge proofs and other cryptographic schemes. We present a protocol for people to securely compute the AN...

متن کامل

Card-Based Protocols for Any Boolean Function

Card-based protocols that are based on a deck of physical cards achieve secure multi-party computation with information-theoretic secrecy. Using existing AND, XOR, NOT, and copy protocols, one can naively construct a secure computation protocol for any given (multivariable) Boolean function as long as there are plenty of additional cards. However, an explicit sufficient number of cards for comp...

متن کامل

The Five-Card Trick Can Be Done with Four Cards

The “five-card trick” invented by Boer allows Alice and Bob to securely compute the AND function of their secret inputs using five cards—three black cards and two red cards—with identical backs. This paper shows that such a secure computation can be done with only four cards. Specifically, we give a protocol to achieve a secure computation of AND using only four cards—two black and two red. Our...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2013